Project Description
For my final project I created a system for visualizing Wikipedia data.
How to Use
Running this program is relatively straight forward. To Run first type the program name followed by the location of the dataset and the title of the Wikipeida article you are trying to look up. It is important to note that if there are spaces in the name of the article you wish to visualize you must replace them with underscores because that is how they are represented in the dataset.
How it Works
This program uses the Multilevel drawing algorithm proposed by David Harel and Yehuda Koren in "A Fast Multi-Scale Method for Drawing Large Graphs". This algorithm works by performing the following: First create small smooth graphs of the clusters using K-Centers and the Kamada Kawai Algorithm to Minimize the energy contained in the graph. The goal of these clusters is to minimize the maximum distance between two nodes in the same cluster. Next perform a smoothing step on the entire graph to correct in annomalies created by the local neighborhood smoothing. Finally, perform neighborhood smoothing once more to correct any lower level annomalies created by the second step. The algorithm is able to run in time O(|V||E|).
Data and other info
The data for my project can be found here. Make sure to use the rdf/xml dataset when running this project. The program can take a relatively long time to run if the recursion isn't limited, so I have hardcoded a restraint that will restrict it to the first 10 internal links. If you would like this changed please contact me.